Modified Log-sobolev Inequalities and Isoperimetry
نویسنده
چکیده
We find sufficient conditions for a probability measure μ to satisfy an inequality of the type ∫ Rd fF ( f ∫ Rd f 2 dμ ) dμ ≤ C ∫ Rd f2c∗ ( |∇f | |f | ) dμ + B ∫ Rd f dμ, where F is concave and c (a cost function) is convex. We show that under broad assumptions on c and F the above inequality holds if for some δ > 0 and ε > 0 one has ∫ ε 0 Φ ( δc [ tF ( 1t ) Iμ(t) ]) dt <∞, where Iμ is the isoperimetric function of μ and Φ = (yF (y)− y)∗. In a partial case Iμ(t) ≥ ktφ1− 1 α (1/t), where φ is a concave function growing not faster than log, k > 0, 1 < α ≤ 2 and t ≤ 1/2, we establish a family of tight inequalities interpolating between the F -Sobolev and modified inequalities of log-Sobolev type. A basic example is given by convex measures satisfying certain integrability assumptions.
منابع مشابه
Log-sobolev, Isoperimetry and Transport Inequalities on Graphs
In this paper, we study some functional inequalities (such as Poincaré inequalities, logarithmic Sobolev inequalities, generalized Cheeger isoperimetric inequalities, transportation-information inequalities and transportation-entropy inequalities) for reversible nearest-neighbor Markov processes on a connected finite graph by means of (random) path method. We provide estimates of the involved c...
متن کاملIsoperimetry and Symmetrization for Logarithmic Sobolev Inequalities
Using isoperimetry and symmetrization we provide a unified framework to study the classical and logarithmic Sobolev inequalities. In particular, we obtain new Gaussian symmetrization inequalities and connect them with logarithmic Sobolev inequalities. Our methods are very general and can be easily adapted to more general contexts.
متن کاملModified Logarithmic Sobolev Inequalities in Discrete Settings
Motivated by the rate at which the entropy of an ergodic Markov chain relative to its stationary distribution decays to zero, we study modified versions of logarithmic Sobolev inequalities in the discrete setting of finite Markov chains and graphs. These inequalities turn out to be weaker than the standard log-Sobolev inequality, but stronger than the Poincare’ (spectral gap) inequality. We sho...
متن کاملLogarithmic Sobolev, Isoperimetry and Transport Inequalities on Graphs
In this paper, we study some functional inequalities (such as Poincaré inequality, logarithmic Sobolev inequality, generalized Cheeger isoperimetric inequality, transportation-information inequality and transportation-entropy inequality) for reversible nearest-neighbor Markov processes on connected finite graphs by means of (random) path method. We provide estimates of the involved constants.
متن کاملOn Equivalence of Super Log Sobolev and Nash Type Inequalities
We prove the equivalence of Nash type and super log Sobolev inequalities for Dirichlet forms. We also show that both inequalities are equivalent to Orlicz-Sobolev type inequalities. No ultracontractivity of the semigroup is assumed. It is known that there is no equivalence between super log Sobolev or Nash type inequalities and ultracontractivity. We discuss Davies-Simon’s counterexample as bor...
متن کامل